Turing Computations On Ordinals
نویسندگان
چکیده
منابع مشابه
Turing computations on ordinals
We define the notion of ordinal computability by generalizing standard Turing computability on tapes of length ω to computations on tapes of arbitrary ordinal length. We show that a set of ordinals is ordinal computable from a finite set of ordinal parameters if and only if it is an element of Gödel’s constructible universe L. This characterization can be used to prove the generalized continuum...
متن کاملRegister computations on ordinals
We generalize ordinary register machines on natural numbers to machines whose registers contain arbitrary ordinals. Ordinal register machines are able to compute a recursive bounded truth predicate on the ordinals. The class of sets of ordinals which can be read off the truth predicate satisfies a natural theory SO. SO is the theory of the sets of ordinals in a model of the Zermelo-Fraenkel axi...
متن کاملOrdinals, Computations, and Models of Set Theory
Ordinary computations can be characterised by register machines working with natural numbers. We study ordinal register machines where the registers can hold arbitrary ordinal numbers. The class of sets of ordinals which are computable by such machines has strong closure properties and satisfies the set theoretic axiom system SO. This implies that ordinal computability is equivalent to Gödel’s ...
متن کاملQuantum Turing Machines Computations and Measurements
We propose a new formulation of Quantum Turing Machines, as an extension of those proposed by Bernstein and Vazirani. For this new class of Quantum Turing Machines, both finite and infinite computations are meaningful—an infinite computation does not correspond trivially to a divergent function. Moreover, we propose a natural observation protocol for the new QTMs, that does not modify the proba...
متن کاملTape-Reversal Bounded Turing Machine Computations
This paper studies the classification of recursive sets by the number of tape reversals required for their recognition on a two-tape Turing machine with a one-way input tape. This measure yields a rich hierarchy of tape-reversal limited complexity classes and their properties and ordering are investigated. The most striking difference between this and the previously studied complexity measures ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of Symbolic Logic
سال: 2005
ISSN: 1079-8986,1943-5894
DOI: 10.2178/bsl/1122038993